Branched Polyhedral Systems
نویسندگان
چکیده
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other polyhedra. The framework, for instance, simultaneously generalizes extended formulations like the well-known ones (see Balas [1]) for the convex hulls of unions of polyhedra (disjunctive programming) and like those obtained from dynamic programming algorithms for combinatorial optimization problems (due to Martin, Rardin, and Campbell [10]). Using the framework, we construct extended formulations for full orbitopes (the convex hulls of all 0/1-matrices with lexicographically sorted columns), we show at the examples of two special matching problems, how polyhedral branching systems can be exploited in order to construct formulations for certain nested combinatorial problems, and we indicate how one can build extended formulations for stable set polytopes using the framework of polyhedral branching systems.
منابع مشابه
Tight polyhedral models of isoparametric families, and PL-taut submanifolds
We present polyhedral models for isoparametric families in the sphere with at most three principal curvatures. Each member of the family (including the analogues of the focal sets) is tight in the boundary complex of an ambient convex polytope. In particular, the tube around the real (or complex) Veronese surface is represented as a tight polyhedron in 5-space (or 8-space). The examples are bas...
متن کاملJu n 20 01 The many faces of cyclic branched coverings of 2 - bridge knots and links ∗
We discuss 3-manifolds which are cyclic coverings of the 3-sphere, branched over 2-bridge knots and links. Different descriptions of these manifolds are presented: polyhedral, Heegaard diagram, Dehn surgery and coloured graph constructions. Using these descriptions, we give presentations for their fundamental groups, which are cyclic presentations in the case of 2-bridge knots. The homology gro...
متن کاملDiscrete uniformization of finite branched covers over the Riemann sphere via hyper-ideal circle patterns
With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral surfaces with non-positive curvature. We show that in the case of such surfaces discrete uniformization via hyper-ideal circle patterns always exists and is uniqu...
متن کاملRobust portfolio selection with polyhedral ambiguous inputs
Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...
متن کاملGenerating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کامل